convex programming的例句大全

Genetic algorithm written in C #. It can be used to solve TSP, Time non-convex programming problems.

运用c # 语言实现模拟退火算法, 同时利用该算法解决旅行商(TSP)问题,获得遍历所有城市序号的最优路径.

Convex analysis, Lagrangian relaxation, non differentiable optimization, and applications in integer programming.

凸分析 、 拉格朗日松弛法 、 不可微分函数最适化以及在整数规划上的应用.

In this peper some sufficient optimality conditions and duality theorems are obtained for a semi-infinite programming problem in the symmetrically differentiable generalized convex functions and the set of active constraints index is infinite countable set case.

在对称可微广义凸函数、起作用约束指标集为无穷可数集的情形下，得到了半无限规划的几个最优性充分条件和对偶性定理。

The optimality conditions for multiobjective semi-infinite programming with semilocally convex functions are given.

研究半局部凸函数在多目标半无限规划下的最优性.

Finally, optimality necessary and sufficient conditions for nonlinear convex semidefinite programming are proved.

并给出了非线性半定规划的最优性必要和充分条件.